On weak lumpability in Markov chains
نویسندگان
چکیده
منابع مشابه
On Weak Lumpability of Denumerable Markov Chains
We consider weak lumpability of denumerable discrete or continuous time Markov chains. Firstly, we are concerned with irreducible recurrent positive and R-positive Markov chains evolving in discrete time. We study the properties of the set of all initial distributions of the starting chain leading to an aggregated homogeneous Markov chain with respect to a partition of the state space. In parti...
متن کاملWeighted Lumpability on Markov Chains
This paper reconsiders Bernardo’s T-lumpability on continuous-time Markov chains (CTMCs). This notion allows for a more aggressive state-level aggregation than ordinary lumpability. We provide a novel structural definition of (what we refer to as) weighted lumpability, prove some elementary properties, and investigate its compatibility with linear real-time objectives. The main result is that t...
متن کاملA geometric invariant in weak lumpability of finite Markov chains
We consider weak lumpability of finite homogeneous Markov chains, that is when a lumped Markov chain with respect to a partition of the initial state space is also a homogeneous Markov chain. We show that weak lumpability is equivalent to the existence of a direct sum of polyhedral cones which is is positively invariant by the transition probability matrix of the original chain. It allows us, i...
متن کاملWeak Lumpability of Finite Markov Chains and Positive Invariance of Cones
We consider weak lumpability of general nite homogeneous Markov chains evolving in discrete time, that is when a lumped Markov chain with respect to a partition of the initial state space is also a homogeneous Markov chain. We show that weak lumpabilityis equivalent to the existence of a decomposable polyhedral cone which is positively invariant by the transition probability matrix of the origi...
متن کاملA necessary condition for weak lumpability in finite Markov processes
Under certain conditions, the state space of a homogeneous Markov process can be partitionned to construct an aggregated markovian process. However, the verification of these conditions requires expensive computations. In this note, we expose a necessary condition for having a markovian aggregated process. This condition is based on properties of the eigenvalues of certain submatrices of the tr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Probability
سال: 1989
ISSN: 0021-9002,1475-6072
DOI: 10.1017/s0021900200038055